- combinatorial triangulation
- мат.комбинаторная триангуляция
English-Russian scientific dictionary. 2008.
combinatorial triangulation
Смотреть что такое "combinatorial triangulation" в других словарях:
Combinatorial meta-analysis — (CMA) is the study of the behaviour of statistical properties of combinations of studies from a meta analytic dataset (typically in social science research). In an article that develops the notion of gravity in the context of meta analysis, Dr.… … Wikipedia
Triangulation (topology) — In mathematics, topology generalizes the notion of triangulation in a natural way as follows: A triangulation of a topological space X is a simplicial complex K , homeomorphic to X , together with a homeomorphism h : K o X . Triangulation is… … Wikipedia
List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… … Wikipedia
Constrained Delaunay triangulation — In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required segments into the triangulation[1][2]. Because a Delaunay triangulation is almost always unique, often… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… … Wikipedia
Dessin d'enfant — In mathematics, a dessin d enfant (French for a child s drawing , plural dessins d enfants, children s drawings ) is a type of graph drawing used to study Riemann surfaces and to provide combinatorial invariants for the action of the absolute… … Wikipedia
Computational geometry — is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to… … Wikipedia
Zugzwang — For the musical work written by Juan Maria Solare, see Zugzwang (musical work). Not to be confused with zwischenzug. Zugzwang (German for compulsion to move , pronounced [ˈtsuːktsvaŋ]) is a term usually used in chess which also applies to various … Wikipedia
Clique complex — “Whitney complex” redirects here. For the Mississippi sports facility, see Davey Whitney Complex. Clique complexes, flag complexes, and conformal hypergraphs are closely related mathematical objects in graph theory and geometric topology that… … Wikipedia
Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… … Wikipedia
